package leetcode.array;

/**
 * @description:搜索旋转排序数组
 * 二分查找法
 * @author: cyy
 **/
public class Demo20211121_1 {
    public static void main(String[] args) {
        int[] nums = {3,4,5,6,7,0,1,2};
        int target = 7 ;
        System.out.println("result:" + search(nums,target));
    }


    public static int search(int[] nums, int target) {
        if (nums.length == 0 )  return  -1;
        if (nums.length == 1 )  return  nums[0] == target ? 0 : -1;
        int left = 0 ;
        int right = nums.length - 1 ;
        while (left <= right){
            int mid = (left + right) / 2;
            if (nums[mid] == target) return  mid ;
            if (nums[0] <= nums[mid]){
                if (nums[0] <= target && target < nums[mid]){
                    right = mid - 1;
                }else{
                    left = mid + 1;
                }
            }else {
                if (nums[mid] < target && target <= nums[right]){
                    left = mid + 1 ;
                }else{
                    right = mid - 1 ;
                }
            }
        }
        return  -1;
    }

}
